Method for Approximation of Diverse Individual Sorting Rules

نویسنده

  • Alexey Petrovsky
چکیده

This paper considers the technique to construct the general decision rule for the contradictory expert classification of objects which are described with many qualitative attributes. This approach is based on the theory of multiset metric spaces, and allows to classify a collection of multi-attribute objects and define the classification rule which approximates the set of individual sorting rules.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple Criteria project Selection based on Contradictory Sorting Rules

This paper considers the techniques for selecting a collection of projects which are estimated by several experts with many qualitative criteria and sorted beforehand into some classes by diverse individual sorting rules. These tools are based on the theory of multiset metric spaces and allow to generate classes of such objects and define a general classification rule which approximates the set...

متن کامل

Approximation Quality for Sorting Rules

A method is presented for the approximation quality for sorting rules, which is based on Rough Set Data Analysis. Several types of rules are discussed: The “nominal nominal” case (NN) (the classical Rough Set approach), “nominal ordinal” (NO) rules, and “ordinal ordinal” (OO) rules, and its generalisation to “(nominal, ordinal) ordinal” rules (NO-O). We provide a significance test for the overa...

متن کامل

Rule Pairing Methods for Crossover in GA for Automatic Generation of Fuzzy Control Rules

We had presented fuzzy rule generation methods by Genetic Algorithm. In this paper, we propose three methods to determine rule pairs for crossover in GA for fuzzy rules generation in order to improve search e ciency and reduction of the number of rules. The rst two methods are that rule pairs are determined based on a distance between rules of two individuals to be crossed. The third one is tha...

متن کامل

Approximate Sorting of Preference Data

We consider sorting data in noisy conditions. Whereas sorting itself is a well studied topic, ordering items when the comparisons between objects can suffer from noise is a rarely addressed question. However, the capability of handling noisy sorting can be of a prominent importance, in particular in applications such as preference analysis. Here, orderings represent consumer preferences (“ranki...

متن کامل

Finding Small High Performance Subsets of Induced Rule Sets: Extended Summary

Models consisting of decision rules – such as those produced by methods from Pawlak’s rough set theory – generally have a white-box nature, but in practice induced models are too large to be inspected. Here, we investigate methods for simplifying complex models while retaining predictive performance. The approach taken is rule filtering, i.e. post-pruning of complete rules. Two methods for find...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Informatica, Lith. Acad. Sci.

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2001